منابع مشابه
Cyclins: wheels within wheels.
Cycimns were originally defined as proteins which are synthesized in each cell cycle and destroyed at every mitosis. Cyclins were discovered by T. Hunt and students at the Marine Biological Laboratory, Woods Hole, MA, duningthe 1982 Physiology Course (1). They labeled eggs ofthe sea urchin Arbacia punctulata with [35S]methionine after fertilization and analyzed the temporal pattern of protein s...
متن کاملDetecting wheels
A wheel is a graph made of a cycle of length at least 4 together with a vertex that has at least three neighbors in the cycle. We prove that the problem whose instance is a graph G and whose question is “does G contains a wheel as an induced subgraph” is NP-complete. We also settle the complexity of several similar problems.
متن کاملWheels within Wheels: Making Fault Management Cost-Effective
Local design and optimization of the components of a fault-management system results in sub-optimal decisions. This means that the target system will likely not meet its objectives (under-performs) or cost too much if conditions, objectives, or constraints change. We can fix this by applying a nested, management system for the fault-management system itself. We believe that doing so will produc...
متن کاملA Reappearence of Wheels
Recently, a number of authors [KS, Oh2, Ro] have independently shown that the universal finite type invariant of rational homology 3-spheres on the level of sl2 can be recovered from the Reshetikhin-Turaev sl2 invariant. An important role in Ohtsuki’s proof [Oh3] plays a map j1 (which joins the legs of 2-legged chinese characters) and its relation to a map α in terms of a power series (on the l...
متن کاملOn Chromaticity of Wheels
Let the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific American
سال: 1881
ISSN: 0036-8733
DOI: 10.1038/scientificamerican07301881-4634supp